Fast Ray-Tetrahedron Intersection Using Plucker Coordinates
نویسندگان
چکیده
We present an algorithm for ray–tetrahedron intersection. The algorithm uses Plücker coordinates to represent the ray and the edges of the tetrahedron and employs a robust and efficient test to determine the intersection. The algorithm is highly optimized and provides a significant performance increase over related algorithms.
منابع مشابه
Fast Ray-Axis Aligned Bounding Box Overlap Tests with Plucker Coordinates
Fast ray-axis aligned bounding box overlap tests can be performed by utilizing Plücker coordinates. This method tests the ray against the edges comprising the silhouette of the box instead of testing against individual faces. Projection of the edges onto a two-dimensional plane to generate the silhouette is not necessary, which simplifies the technique. The method is division-free and successiv...
متن کاملRay-Triangle and Ray-Quadrilateral Intersections in Homogeneous Coordinates
Recent articles in Ray Tracing News have discussed solutions to the problem of intersecting a ray with a triangle using the triangle’s barycentric coordinates. This article shows yet another way to think about the ray-triangle intersection problem. The idea is to think of the barycentric coordinates of the intersection point, not as the ratio of areas, but rather as the as ratios of the volume ...
متن کاملTechnical Report Fast Ray Traversal of Unstructured Volume Data using Plucker Tests
The importance of high-performance rendering of unstructured data sets has increased significantly mainly due to its use in scientific simulations such as computational fluid dynamics and finite element computations. However, the unstructured nature of these data sets complicate their handling and lead to low performance even with hardware support through GPUs. In this paper, we present a new t...
متن کاملGeometry, Duality and Robust Computation in Engineering
Robustness of computations in engineering is one of key issues as it is necessary to solve technical problems leading to ill conditioned solutions. Therefore the robustness and numerical stability is becoming a key issue more important that the computational time. In this paper we will show selected computational issues in numerical precision, well known cases of failures in computations. The E...
متن کاملMultiresolution Techniques for the Simplification of Triangular and Tetrahedral Meshes
We study the simplification of triangular and tetrahedral meshes using techniques based on successive edge collapses, as well as the exploitation of the generated multiple levels of detail for the effective processing of the models. Regarding triangular meshes, we present a method for the construction of progressive hulls, by suitable edge collapses; we use the generated hulls for the accelerat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Graphics, GPU, & Game Tools
دوره 8 شماره
صفحات -
تاریخ انتشار 2003